Almost sure convergence of a class of stochastic algorithms
نویسندگان
چکیده
منابع مشابه
Almost sure convergence of randomly truncated stochastic algorithms under verifiable conditions
Abstract. In this paper, we are interested in the almost sure convergence of randomly truncated stochastic algorithms. In their pioneer work, Chen and Zhu (1986) required that the family of the noise terms is summable to ensure the convergence. In our paper, we present a new convergence theorem which extends the already known results by making vanish this condition on the noise terms — a condit...
متن کاملAlmost Sure Convergence to Zero in Stochastic Growth Models
This paper shows that in stochastic one-sector growth models, if the production function does not satisfy the Inada condition at zero, any feasible path converges to zero with probability one provided that the shocks are sufficiently volatile. This result seems significant since, as we argue, the Inada condition at zero is difficult to justify on economic grounds. Our convergence result is exte...
متن کاملAlmost Sure Convergence Rates for the Estimation of a Covariance Operator for Negatively Associated Samples
Let {Xn, n >= 1} be a strictly stationary sequence of negatively associated random variables, with common continuous and bounded distribution function F. In this paper, we consider the estimation of the two-dimensional distribution function of (X1,Xk+1) based on histogram type estimators as well as the estimation of the covariance function of the limit empirical process induced by the se...
متن کاملAlmost sure convergence of the Bartlett estimator
We study the almost sure convergence of the Bartlett estimator for the asymptotic variance of the sample mean of a stationary weekly dependent process. We also study the a. s. behavior of this estimator in the case of long-range dependent observations. In the weakly dependent case, we establish conditions under which the estimator is strongly consistent. We also show that, after appropriate nor...
متن کاملJakimovski Methods and Almost-Sure Convergence
The classical summability methods of Borel (B) and Euler (E(λ), λ > 0) play an important role in many areas of mathematics. For instance, in summability theory they are perhaps the most important methods other than the Cesàro (Cα) and Abel (A) methods, and two chapters of the classic book of Hardy (1949) are devoted to them. In probability, the distinction between methods of Cesàro-Abel and Eul...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Stochastic Processes and their Applications
سال: 1994
ISSN: 0304-4149
DOI: 10.1016/0304-4149(94)90149-x